Multiplicative complexity of vector valued Boolean functions
نویسندگان
چکیده
منابع مشابه
Multiplicative complexity of vector valued Boolean functions
We consider the multiplicative complexity of Boolean functions with multiple bits of output, studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity. For so-called ΣΠΣ circuits, we show that there is a tight connection between error correcting codes and circuits computing functions with high nonlinearity. Combining this with known coding theo...
متن کاملCircuit Complexity and Multiplicative Complexity of Boolean Functions
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3− c lower bound on the circuit complexity of a large class of functions representable by high degree polynomials over GF(2). The key idea of the proof is a circuit complexity measure assigning different weights to XOR and AND gates.
متن کاملThe number of boolean functions with multiplicative complexity 2
Multiplicative complexity is a complexity measure defined as the minimum number of AND gates required to implement a given primitive by a circuit over the basis (AND, XOR, NOT). Implementations of ciphers with a small number of AND gates are preferred in protocols for fully homomorphic encryption, multi-party computation and zero-knowledge proofs. In 2002, Fischer and Peralta [12] showed that t...
متن کاملA relation between additive and multiplicative complexity of Boolean functions
In the present note we prove an asymptotically tight relation between additive and multiplicative complexity of Boolean functions with respect to implementation by circuits over the basis {⊕,∧, 1}. To start, consider a problem of computation of polynomials over a semiring (K,+,×) by circuits over the arithmetic basis {+,×} ∪K. It’s a common knowledge that a polynomial of n variables with nonsca...
متن کاملComplexity of Boolean Functions
s of Presentation: Paul Beame: Time-Space Tradeoffs and Multiparty Communication Complexity 9 Beate Bollig: Exponential Lower Bounds for Integer Multiplication Using Universal Hashing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Philipp Wölfel: On k-wise l-mixed Boolean Functions . . . . . . . . . . . . . . 10 Elizabeta Okol’nishnikova: On One Lower Bound for Branching Progra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2018
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2018.02.023